Bounds on the Linear Complexity and the 1-Error Linear Complexity over Fp of M-ary Sidel'nikov Sequences
نویسندگان
چکیده
In this paper, we derive linear complexity over Fp of the M -ary Sidel’nikov sequences using discrete Fourier transform. As an example, we represent the linear complexities of the ternary Sidel’nikov sequences. It turned out that the ternary Sidel’nikov sequences have the linear complexity nearly close to their periods.
منابع مشابه
Linear Complexity over Fp of Ternary Sidel'nikov Sequences
In this paper, for positive integers m, M , and a prime p such that M |pm − 1, we derive linear complexity over the prime field Fp of M -ary Sidel’nikov sequences of period pm−1 using discrete Fourier transform. As a special case, the linear complexity of the ternary Sidel’nikov sequence is presented. It turns out that the linear complexity of a ternary Sidel’nikov sequence with the symbol k0 =...
متن کاملRemarks on the k-error linear complexity of pn-periodic sequences
Recently the first author presented exact formulas for the number of 2-periodic binary sequences with given 1-error linear complexity, and an exact formula for the expected 1-error linear complexity and upper and lower bounds for the expected k-error linear complexity, k ≥ 2, of a random 2-periodic binary sequence. A crucial role for the analysis played the Chan-Games algorithm. We use a more s...
متن کاملOne-Error Linear Complexity over Fp of Sidelnikov Sequences
Let p be an odd prime and m be a positive integer. In this paper, we prove that the one-error linear complexity over Fp of Sidelnikov sequences of length p − 1 is ( p+1 2 ) − 1, which is much less than its (zero-error) linear complexity.
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملOn the linear complexity of Sidel'nikov sequences over nonprime fields
We introduce a generalization of Sidel’nikov sequences for arbitrary finite fields. We show that several classes of Sidel’nikov sequences over arbitrary finite fields exhibit a large linear complexity. For Sidel’nikov sequences over F8 we provide exact values for their linear complexity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006